package com.banmao.algorithm.No1To100.No1_Two_Sum;

/**
 *  经典暴力破解法
 */
class Solution01 {
    static int[] twoSum(int[] nums, int target) {
        for(int i=0;i<nums.length-1; i++){
            for(int j=i+1; j<nums.length; j++){
                if(nums[i] + nums[j] == target){

                    return new int[]{i,j};
                }
            }
        }
        return new int[]{0};
    }
}
